A canonical partition theorem for trees
نویسنده
چکیده
We show that for every positive integer d, every downwards closed subtree T of d without terminal nodes and every finite weakly embedded subtree A of T there is a finite list of equivalence relations on Em(T ) with the property that for every other equivalence relation E on Em(T ) there is a strongly embedded subtree S ⊆ T of height ω, such that E Em(S) is equal to one of the equivalence relations from the list.
منابع مشابه
The Canonical Ramsey Theorem and Computability Theory
Using the tools of computability theory and reverse mathematics, we study the complexity of two partition theorems, the Canonical Ramsey Theorem of Erdös and Rado, and the Regressive Function Theorem of Kanamori and McAloon. Our main aim is to analyze the complexity of the solutions to computable instances of these problems in terms of the Turing degrees and the arithmetical hierarchy. We succe...
متن کاملSplitting Trees and Partition Refinement in Real-Time Model Checking
This paper discusses model checking of real-time systems. A novel aspect of our approach is the unconventional approach to deal with representing symbolic state spaces. The representation does not use a canonical form for representing symbolic nodes. Instead it applies an alternative representation based on splitting trees. Unlike often used canonical representations, this representation is tai...
متن کاملCanonical thermostatics of ideal gas in the frame work of generalized uncertainty principle
The statistical consequences of minimal length supposition are investigated for a canonical ensemble of ideal gas. These effects are encoded in the so-called Generalized Uncertainty Principle (GUP) of the second order. In the frame work of the considered GUP scenario, a unique partition function is obtained by using of two different methods of quantum and classical approaches. It should be noti...
متن کاملA Canonical Partition Theorem for Equivalence Relations on Zt
THEOREM A. For every positive integer m there exists a positive integer n such that for every coloring A: (O,..., n 1) + w there exists an arithmetic progression a, a + d,..., a + (m 1)d of length m such that the restriction of A to {a, a + d,..., a + (m l)d} is either a constant or a one-to-one mapping. This theorem is the so called canonical version of van der Waerden’s theorem on arithmetic ...
متن کاملA Partition of the Non - Negative Integers , with Applications
We describe a particular partition of the non-negative integers which consists of infinitely many translates of an infinite set. This partition is used to show that a certain van der Waerden-like theorem has no simple canonical version. The partition is also used to give a lower bound for one of the classical van der Waerden functions, namely w(3;m),the smallest positive integer such that every...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Contributions to Discrete Mathematics
دوره 2 شماره
صفحات -
تاریخ انتشار 2007